Planning with Sharable Resource Constraints
نویسندگان
چکیده
When planning systems deal with realistic domains , they must cope with a large variety of constraints imposed by the environment such as temporal or resource constraints The ro-bustness of the generated plan is a direct consequence of a correct handling of these constraints We argue that increasing the expres-siveness of a representation can be achieved without fundamentally affecting the global efficiency of the search This paper presents a temporal planner, LxTeT, which integrates sharable resource management into the process of plan generation In IxTeT, planning operators are described as temporal structures of conditions, effects and sharable resource uses During the search, pending subgoals, protection threats and resource conflicts are detected by three flaw analysis modules The detection of sharable resource conflicts is performed thanks to an efficient clique-search algorithm on a possible intersection graph The control of the search is based on a least-commitment opportunistic strategy Our approach has been implemented, tested and shown to be satisfactory in various application domains 1 Introduction Classical approaches decompose plan generation and resource management into two different steps for solving a given planning problem Plan generation consists in selecting and organising a set of operators that will achieve the problem goals, its result is a plan, that is a partially ordered set of operators Resource management is then performed on this plan to ensure its correctness with respect to temporal and resource constraints The result, then, is a schedule that, if executed, will ensure the goal resolution while satisfying the physical constraints of the environment The strict separation between plan generation and re source management raises difficulties such as how to backtrack to the plan generation process, when necessary , or how to generate the plan in an opportunistic way according to resource constraints This paper develops a representation and an algorith-mic approach integrated into a system called IxTeT, for handling abreast and in an opportunistic way plan generation and time/resource management The following section is a short digest of scheduling and planning literature that influenced our work Section 3 describes a temporal representation of operators and problems The genera] control of the planner is discussed m section 4 whereas section 5 focuses on the resource analysis module We finally presents some experimental results and applicability domains for our system 2 Related Work 2 1 Scheduling Scheduling systems are essentially concerned with time and resource management ISIS [Fox and Smith, 1984] was …
منابع مشابه
A novel mathematical model for a hybrid flow shop scheduling problem under buffer and resource limitations-A case study
Scheduling problems play a big role in manufacturing and planning the production for increasing the production efficiency and assigning the resources to operations. Furthermore, in many manufacturing systems there is a physical space between stages that called intermediate buffers. In this study, a model is proposed for minimizing the makespan of a hybrid flow shop scheduling problem with inter...
متن کاملA Multi Objective Optimization Approach for Resources Procurement of Bank
Calculating total cast of bank resources procurement methods which include current -free loan deposit, saving interest-free loan deposit, regular and net short-term investment deposit, long-term investment deposit and surety bond cash deposit and presenting their optimal integration require precise scientific studies. Hence, this study is an attempt to know which methods are the best optimal in...
متن کاملMarkov Random Fields based Estimation of Distribution Algorithm and Application of Sharable Resource Constrained Scheduling Problem
During the past several years, a large number of studies have been conducted in the area of sharable resource constrained scheduling problems. Intelligent manufacturing planning and scheduling based on meta-heuristic methods, such as the simulated annealing and particle swarm optimization, have become common tools for finding satisfactory solutions within reasonable computational times in real ...
متن کاملMultiagent resource allocation with sharable items: simple protocols and Nash equilibria
We study a particular multiagent resource allocation problem with indivisible, but sharable resources. In our model, the utility of an agent for using a bundle of resources is the difference between the valuation of that bundle and a congestion cost (or delay), a figure formed by adding up the individual congestion costs of each resource in the bundle. The valuation and the delay can be agent-d...
متن کاملPreallocation and Planning under Stochastic Resource Constraints
Resource constraints frequently complicate multi-agent planning problems. Existing algorithms for resource-constrained, multi-agent planning problems rely on the assumption that the constraints are deterministic. However, frequently resource constraints are themselves subject to uncertainty from external influences. Uncertainty about constraints is especially challenging when agents must execut...
متن کامل